Student Critical thinking in Solving Two Dimensional Armetics Problems Based on 21th Century Skills

Critical thinking has a very important role in constructing the improvement of students\u27 ability to face the 21st century, especially in generalizing the pattern of the two dimensional arithmetic series. Since critical thinking is necessary when we try to understand and process information, put forward ideas or ideas objectively, and develop deeper insights. The purpose of this study is to analyse students\u27 critical thinking skills based on P21. This study is a combination method in which this method is a combination of quantitative and qualitative methods. Research subjects are high school students. This subject is expected to provide an overview of critical thinking based on P21. Data collection techniques in this study are: (1) test, this technique is used to measure the ability of students in mastering the arithmetic array of two dimensions; (2) interview; it is based on the students work in solving the problem of two dimensional arithmetic series. The data result showed that in the experimental class had increased 40.85% on the indicator of effective reasoning, 37,44% on indicator of thinking system, 47,53% on decision indicator, and 42,55% on problem solving indicator. While the control class experienced a 19.5% increase in the effective reasoning indicator, 0.07% on the indicator of the thinking system, 0.02% on the decision making indicator, and 0.02% on the problem solving indicator

Algebraic Learning through Caring Community Based On Lesson Study for Learning Community

Algebraic material is still considered difficult by many students, especially for those in junior high schools. They still find it difficult to understand and solve algebraiv problems. This happens because their level of understanding for algebraic material is still low, therefore it takes the participation of many parties, including peers and parents, to overcome this problem (caring community based learning). This study aims to improve the students’ understanding of the algebraic concept and to minimize the errors that occur in solving algebra problems. The study was conducted in 3 cycles, each cycle consisted of 3 phases, ie plan - do - see, in accordance with the learning cycle in the lesson study. The subjects of this research were 32 students of VII G class of MTs Negeri 2 Jember in the 2017/2018 academic year. Data collection techniques used were observation, tests and documentation. The data were analyzed using descriptive qualitative method through three steps: data reduction, data presentation and conclusion. The results showed that there was a high confidence increase in learning among the students and the “care” occured in the learning process. The students’ understanding and mastery of algebraic material were also improved through caring community based lesson study for learning community

SUPER (a,d)-EDGE ANTIMAGIC TOTAL LABELING OF CONNECTED TRIBUN GRAPH

Abstract. A G graph of order p and size q is called an (a,d)-edge antimagic total if there exist a bijection f:V(G)∪E(G)⟶{1,2,…,p+q} such that the edge-weights, w(uv)=f(u)+f(v)+f(uv), uv∈E(G), form an arithmetic sequence with first term a and common difference d. Such a graph G is called super if the smallest possible labels appear on the vertices. In this paper we study super (a, d)-edge-antimagic total properties of connected Tribun graph. The result shows that a connected Tribun graph admit a super(a,d)-edge antimagic total labeling ford=0,1,2 for n≥1. It can be concluded that the result of this research has covered all the feasible n,d. Key Words: (a,d)-edge antimagic vertex labeling, super(a,d)-edge antimagic total labeling, Tribun Graph.

THE EFFECTIVENESS OF RUNGE-KUTTA METHOD OF ORDER NINE TO SOLVE THE IMMUNITY MODEL FOR INFECTION OF MYCOBACTERIUM TUBERCULOSIS

Abstrak. Model sistem kekebalan tubuh terhadap infeksi Mycobacterium tuberculosis telah dikembangkan dan dikemas dalam bentuk sistem persamaan diferensial biasa non linier order satu. Model tersebut sangat komplek sehingga memerlukan metode numeric untuk menyelesaikannya. Salah satu metode numerik yang yang efektif adalah metode Runge-Kutta. Penelitian ini akan merumuskan formula metode Runge-Kutta order sembilan, dan menentukan sifat dari metode tersebut sebelum merumuskannya, serta menganalisis konvergensi dan efektivitas dari metode Runge-Kutta order sembilan bila dibandingkan dengan metode Adam Bashforth-Moulton order sembilan. Metode dikatakan efektif dan efisien bila error yang terjadi pada metode dalam menyelesaikan model semakin kecil (menuju nol) dan waktu yang dibutuhkan metode untuk menyelesaikan model matematika semakin sedikit. Hasil penelitian menunjukkan bahwa metode Runge-Kutta order sembilan lebih efisien dan efektif dibandingkan metode Adam Bashforth-Moulton order sembilan dalam menyelesaikan model sistem kekebalan tubuh terhadap infeksi Mycobacterium tuberculosis. Kata kunci : Metode Runge-Kutta order sembilan, konvergensi, efektivitas, model sistem kekebalan tubuh terhadap infeksi Mycobacterium tuberculosis

SUPER (a,d)-EDGE ANTIMAGIC TOTAL LABELING OF PENTAGONAL CHAIN GRAPH

Abstract. A G graph of order p and size q is called an (a,d)-edge antimagic total if there exist a bijection f: V(G)E(G) {1,2,…,p+q} such that the edge-weights, w(uv)=f(u)+f(v)+f(uv), uv E(G), form an arithmetic sequence with first term a and common difference d. Such a graph G is called super if the smallest possible labels appear on the vertices. In this paper we study super (a, d)-edge-antimagic total properties of connected PCn by using deductive axiomatic and the pattern recognition method. The result shows that a connected pentagonal chain graphs admit a super (a,d)-edge antimagic total  labeling for d = 0,1,2 for n It can be concluded that the result of this research has covered all the feasible d. Key Words: (a,d)-edge antimagic vertex labeling, super (a,d)-edge antimagic total labeling, Pentagonal Chain Graph

On r-Dynamic Chromatic Number of the Corronation of Path and Several Graphs

This study is a natural extension of k-proper coloring of any simple and connected graph G. By an r-dynamic coloring of a graph G, we mean a proper k-coloring of graph G such that the neighbors of any vertex v receive at least min{r, d(v)} different colors. The r-dynamic chromatic number, written as r(G), is the minimum k such that graph G has an r-dynamic k-coloring. In this paper we will study the r-dynamic chromatic number of the coronation of path and several graph. We denote the corona product of G and H by G⨀▒H. We will obtain the r-dynamic chromatic number of χ_r (P_n⨀P_m ),χ_r (P_n⨀C_m )"and " χ_r (P_n⨀W_m ) for m, n>= 3